Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces
نویسندگان
چکیده
منابع مشابه
Sensitivity analysis in convex programming
The object of this paper is to perform an analysis of the sensitivity for convex vector programs with inequality constraints by examining the quantitative behavior of a certain set of optima according to changes of right-hand side parameters included in the program. The results in the paper prove that the sensitivity of the program depends on the solution of a dual program and its sensitivity. ...
متن کاملSensitivity analysis in multiobjective differential programming
1. I N T R O D U C T I O N The main objective of the present article is to analyze sensitivity in vectorial optimization programs, that is, to study the variations of a set of efficient points when a certain parameter of the program varies. There is a very important fact that marks an essential difference between scalar and vectorial programming. Whereas in the case of scalar programming the op...
متن کاملCharacterization of Properly Efficient Solutions for Convex Multiobjective Programming with Nondifferentiable vanishing constraints
This paper studies the convex multiobjective optimization problem with vanishing constraints. We introduce a new constraint qualification for these problems, and then a necessary optimality condition for properly efficient solutions is presented. Finally by imposing some assumptions, we show that our necessary condition is also sufficient for proper efficiency. Our results are formula...
متن کاملSensitivity analysis in fuzzy multiobjective linear fractional programming problem
In this paper, we study measurement of sensitivity for changes of violations in the aspiration level for the fuzzy multiobjective linear fractional programming problem. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملMultiobjective DC Programming with Infinite Convex Constraints
In this paper new results are established in multiobjective DC programming with infinite convex constraints (MOPIC for abbr.) that are defined on Banach space (finite or infinite) with objectives given as the difference of convex functions subject to infinite convex constraints. This problem can also be called multiobjective DC semi-infinite and infinite programming, where decision variables ru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1996
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0339